John Myhill
   HOME

TheInfoList



OR:

John R. Myhill Sr. (11 August 1923 – 15 February 1987) was a British
mathematician A mathematician is someone who uses an extensive knowledge of mathematics in their work, typically to solve mathematical problems. Mathematicians are concerned with numbers, data, quantity, structure, space, models, and change. History On ...
.


Education

Myhill received his Ph.D. from
Harvard University Harvard University is a private Ivy League research university in Cambridge, Massachusetts. Founded in 1636 as Harvard College and named for its first benefactor, the Puritan clergyman John Harvard, it is the oldest institution of high ...
under
Willard Van Orman Quine Willard Van Orman Quine (; known to his friends as "Van"; June 25, 1908 – December 25, 2000) was an American philosopher and logician in the analytic tradition, recognized as "one of the most influential philosophers of the twentieth century" ...
in 1949. He was professor at SUNY Buffalo from 1966 until his death in 1987. He also taught at several other universities. His son, also called John Myhill, is a professor of linguistics in the English department of the University of Haifa in Israel.


Contributions

In the theory of
formal language In logic, mathematics, computer science, and linguistics, a formal language consists of words whose letters are taken from an alphabet and are well-formed according to a specific set of rules. The alphabet of a formal language consists of sy ...
s, the
Myhill–Nerode theorem In the theory of formal languages, the Myhill–Nerode theorem provides a necessary and sufficient condition for a language to be regular. The theorem is named for John Myhill and Anil Nerode, who proved it at the University of Chicago in 1958 . ...
, proven by Myhill with
Anil Nerode Anil Nerode (born 1932) is an American mathematician. He received his undergraduate education and a Ph.D. in mathematics from the University of Chicago, the latter under the directions of Saunders Mac Lane. He enrolled in the Hutchins College at t ...
, characterizes the
regular language In theoretical computer science and formal language theory, a regular language (also called a rational language) is a formal language that can be defined by a regular expression, in the strict sense in theoretical computer science (as opposed to ...
s as the languages that have only finitely many inequivalent prefixes. In computability theory, the Rice–Myhill–Shapiro theorem, more commonly known as Rice's theorem, states that, for any nontrivial property ''P'' of partial functions, it is undecidable to determine whether a given Turing machine computes a function with property ''P''. The
Myhill isomorphism theorem In computability theory the Myhill isomorphism theorem, named after John Myhill, provides a characterization for two numberings to induce the same notion of computability on a set. Myhill isomorphism theorem Sets ''A'' and ''B'' of natural nu ...
is a computability-theoretic analogue of the Cantor–Bernstein–Schroeder theorem that characterizes the recursive isomorphisms of pairs of sets. In the theory of
cellular automata A cellular automaton (pl. cellular automata, abbrev. CA) is a discrete model of computation studied in automata theory. Cellular automata are also called cellular spaces, tessellation automata, homogeneous structures, cellular structures, tessel ...
, Myhill is known for proving (along with E. F. Moore) the Garden of Eden theorem, stating that a cellular automaton has a configuration with no predecessor if and only if it has two different asymptotic configurations which evolve to the same configuration. He is also known for posing the
firing squad synchronization problem The firing squad synchronization problem is a problem in computer science and cellular automata in which the goal is to design a cellular automaton that, starting with a single active cell, eventually reaches a state in which all cells are simulta ...
of designing an automaton that, starting from a single non-quiescent cell, evolves to a configuration in which all cells reach the same non-quiescent state at the same time; this problem was again solved by Moore. In
constructive set theory Constructive set theory is an approach to mathematical constructivism following the program of axiomatic set theory. The same first-order language with "=" and "\in" of classical set theory is usually used, so this is not to be confused with a con ...
, Myhill is known for proposing an axiom system that avoids the
axiom of choice In mathematics, the axiom of choice, or AC, is an axiom of set theory equivalent to the statement that ''a Cartesian product of a collection of non-empty sets is non-empty''. Informally put, the axiom of choice says that given any collection ...
and the
law of the excluded middle In logic, the law of excluded middle (or the principle of excluded middle) states that for every proposition, either this proposition or its negation is true. It is one of the so-called three laws of thought, along with the law of noncontradi ...
, known as intuitionistic Zermelo–Fraenkel. He also developed a constructive set theory based on natural numbers, functions, and sets, rather than (as in many other foundational theories) basing it purely on sets. The Russell–Myhill paradox or Russell–Myhill antinomy, discovered by
Bertrand Russell Bertrand Arthur William Russell, 3rd Earl Russell, (18 May 1872 – 2 February 1970) was a British mathematician, philosopher, logician, and public intellectual. He had a considerable influence on mathematics, logic, set theory, linguistics, ...
in 1902 (and discussed in his ''
The Principles of Mathematics ''The Principles of Mathematics'' (''PoM'') is a 1903 book by Bertrand Russell, in which the author presented his famous Russell's paradox, paradox and argued his thesis that mathematics and logic are identical. The book presents a view of ...
'', 1903) and rediscovered by Myhill in 1958,"Problems Arising in the Formalization of Intensional Logic." ''Logique et Analyse'' 1 (1958): 78–83 concerns systems of logic in which logical propositions can be members of classes, and can also be about classes; for instance, a proposition ''P'' can "state the product" of a class ''C'', meaning that proposition ''P'' asserts that all propositions contained in class ''C'' are true. In such a system, the class of propositions that state the product of classes that do not include them is paradoxical. For, if proposition ''P'' states the product of this class, an inconsistency arises regardless of whether ''P'' does or does not belong to the class it describes. In music theory, Myhill's property is a mathematical property of
musical scale In music theory, a scale is any set of musical notes ordered by fundamental frequency or pitch. A scale ordered by increasing pitch is an ascending scale, and a scale ordered by decreasing pitch is a descending scale. Often, especially in the ...
s described by John Clough and Gerald Myerson and named by them after Myhill.


See also

* Diaconescu–Goodman–Myhill theorem


References

{{DEFAULTSORT:Myhill, John 1923 births 1987 deaths 20th-century British mathematicians Harvard University alumni University at Buffalo faculty Cellular automatists George Berkeley scholars